Coherent Minimisation: Towards efficient tamper-proof compilation
نویسندگان
چکیده
منابع مشابه
Coherent Minimisation: Towards efficient tamper-proof compilation
Automata representing game-semantic models of programs are meant to operate in environments whose input-output behaviour is constrained by the rules of a game. This can lead to a notion of equivalence between states which is weaker than the conventional notion of bisimulation, since not all actions are available to the environment. An environment which attempts to break the rules of the game is...
متن کاملOn Efficient Non-Interactive Oblivious Transfer with Tamper-Proof Hardware
Oblivious transfer (OT, for short) [Rab81] is a fundamental primitive in the foundations of Cryptography. While in the standard model OT constructions rely on public-key cryptography, only very recently Kolesnikov in [Kol10] showed a truly efficient string OT protocol by using tamper-proof hardware tokens. His construction only needs few evaluations of a block cipher and requires stateless (the...
متن کاملTruly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
SFE requires expensive public key operations for each input bit of the function. This cost can be avoided by using tamper-proof hardware. However, all known efficient techniques require the hardware to have long-term secure storage and to be resistant to reset or duplication attacks. This is due to the intrinsic use of counters or erasures. Known techniques that use resettable tokens rely on ex...
متن کاملTamper-Proof Annotations, By Construction
Current mobile-code formats require veri cation by the code recipient to guard against potentially malicious actions of an incoming mobile program. Such veri cation is needed even when a mobile program originated in a \safe" language such as Java, because the transmission might have been corrupted by an adversary. We describe an alternative approach based on a family of mobile code formats that...
متن کاملTamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that the tampered device will reveal secret information. Inspired by the work of Ishai et al. [Eurocrypt’06], we propose a compiler that transforms any circuit into a new circuit with the same functionality, but which is resilient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.104.8